def binarry_search(A:list, digit:int):
    print(A)

    if A[0] == digit:
        return digit

    if (len(A)-1)//2 < digit:
        middle = (len(A)-1) - ((len(A)-1))//2)

    left = []
    right = []

    for index in range(len(A)):
        if A[index] <= middle:
            left.append(A[index])
        else:
            right.append(A[index])

    binarry_search(left, digit)
    binarry_search(right, digit)

l = [i for i in range(1, 101)]
print(binarry_search(l, 42))
